Compress‐and‐restart block Krylov subspace methods for Sylvester matrix equations
نویسندگان
چکیده
منابع مشابه
Krylov Subspace Methods for Large-Scale Constrained Sylvester Equations
We consider the numerical approximation to the solution of the matrix equation A1X+XA2 −Y C = 0 in the unknown matrices X, Y , under the constraint XB = 0, with A1, A2 of large dimensions. We propose a new formulation of the problem that entails the numerical solution of an unconstrained Sylvester equation. The spectral properties of the resulting coefficient matrices call for appropriately des...
متن کاملKrylov subspace methods for projected Lyapunov equations
We consider the numerical solution of projected Lyapunov equations using Krylov subspace iterative methods. Such equations play a fundamental role in balanced truncation model reduction of descriptor systems. We present generalizations of the extended block and global Arnoldi methods to projected Lyapunov equations and compare these methods with the alternating direction implicit method with re...
متن کاملPreconditioned Krylov Subspace Methods for Transport Equations
Transport equations have many important applications. Because the equations are based on highly non-normal operators, they present diiculties in numerical computations. The iterative methods have been shown to be one of eecient numerical methods to solve transport equations. However, because of the nature of transport problems, convergence of iterative methods tends to slow for many important p...
متن کاملSylvester Equations and the Factorization of the Error System in Krylov Subspace Methods
This paper presents a factorization of the error system that arises in model reduction of linear time invariant systems by Krylov subspace methods. The factorization is introduced for reduced models that match moments and/or Markov parameters of the original system with multiple inputs and outputs. Furthermore, dual results are given for the reduction with input and output Krylov subspaces. To ...
متن کاملBlock Krylov Subspace Spectral Methods for Variable-Coefficient Elliptic PDE
Krylov subspace spectral (KSS) methods have been demonstrated to be effective tools for solving time-dependent variable-coefficient PDE. They employ techniques developed by Golub and Meurant for computing elements of functions of matrices to approximate each Fourier coefficient of the solution using a Gaussian quadrature rule that is tailored to that coefficient. In this paper, we apply this sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2020
ISSN: 1070-5325,1099-1506
DOI: 10.1002/nla.2339